A Literal Code Method For Minimizing Boolean Functions
نویسندگان
چکیده
منابع مشابه
A quasisecant method for minimizing nonsmooth functions
In this paper a new algorithm to locally minimize nonsmooth, nonconvex functions is developed. We introduce the notion of secants and quasisecants for nonsmooth functions. The quasisecants are applied to find descent directions of locally Lipschitz functions. We design a minimization algorithm which uses quasisecants to find descent directions. We prove that this algorithm converges to Clarke s...
متن کاملCombinatorial method for Boolean SAC functions designing
In this paper a new approach for designing Boolean functions that satisfy the Strict Avalanche Criterion (SAC) is presented. The advantage of the suggested approach is the simplicity of its realization and the significant greater number of the generated functions compared to the known methods. The formalized procedure for construction of nonbalanced and balanced SAC-functions is described in de...
متن کاملA Simplification Method of Polymorphic Boolean Functions
Polymorphic circuits are a special kind of circuits which possess multiple build-in functions, and these functions are activated by environment parameters, like temperature, light and VDD. The behavior of a polymorphic circuit can be described by a polymorphic Boolean function. For the first time, this brief presents a simplification method of the polymorphic Boolean function.
متن کاملMinimizing the Average Query Complexity of Learning Monotone Boolean Functions
This paper addresses the problem of completely reconstructing deterministic monotone Boolean functions via membership queries. The minimum average query complexity is guaranteed via recursion, where partially ordered sets (posets) make up the overlapping subproblems. For problems with up to 4 variables, the posets’ optimality conditions are summarized in the form of an evaluative criterion. The...
متن کاملA Fast Computerized Method For Automatic Simplification of Boolean Functions
This paper introduces a new fast systematic method for minimization of the Boolean functions. This method is a very simple because there is no need for any visual representation such as Karnough map or arrangement technique such as Tabulation method and is very easy for programming. Furthermore, it is very suitable for boolean function with large number of variables (more than 4 variable). In a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1990
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/33.4.375